35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality
نویسندگان
چکیده
منابع مشابه
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
We consider the asymmetric traveling salesperson problem with γ-parameterized triangle inequality for γ ∈ [ 1 2 , 1). That means, the edge weights fulfill w(u, v) ≤ γ · (w(u, x) + w(x, v)) for all nodes u, v, x. Chandran and Ram [8] recently gave the first constant factor approximation algorithm with polynomial running time for this problem. They achieve performance ratio γ 1−γ . We devise an a...
متن کامل35/44-approximation for Asymmetric maxTSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maxTSP with triangle inequality. Our algorithm achieves approximation factor 35/44 which improves on the previous 10/13 factor of Kaplan et al. [5].
متن کاملPerformance Guarantees for the TSP with a Parameterized Triangle Inequality
We consider the approximability of the tsp problem in graphs that satisfy a relaxed form of triangle inequality. More precisely, we assume that for some parameter 1, the distances satisfy the inequality dist(x; y) (dist(x; z) + dist(z; y)) for every triple of vertices x, y, and z. We obtain a 4 approximation and also show that for some > 0 it is np-hard to obtain a (1 +) approximation. Our uppe...
متن کاملAn Approximation Algorithm for Maximum Triangle Packing
We present a randomized ( 89 169 − )-approximation algorithm for the weighted maximum triangle packing problem, for any given > 0. This is the first algorithm for this problem whose performance guarantee is better than 1 2 . The algorithm also improves the best-known approximation bound for the maximum 2-edge path packing problem. © 2005 Elsevier B.V. All rights reserved.
متن کاملTwo Approximation Algorithms for ATSP with Strengthened Triangle Inequality
In this paper, we study the asymmetric traveling salesman problem (ATSP) with strengthened triangle inequality, i.e. for some γ ∈ [ 1 2 , 1) the edge weights satisfy w(u, v) ≤ γ(w(u, x) + w(x, v)) for all distinct vertices u, v, x. We present two approximation algorithms for this problem. The first one is very simple and has approximation ratio 1 2(1−γ) , which is better than all previous resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2009
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-009-9306-3